On a Weighted Quasi-residual Minimization Strategy for Solving Complex Symmetric Shifted Linear Systems
نویسندگان
چکیده
We consider the solution of complex symmetric shifted linear systems. Such systems arise in largescale electronic structure simulations, and there is a strong need of algorithms for their fast solution. With the aim of solving the systems efficiently, we consider a special case of the QMR method for non-Hermitian shifted linear systems and propose its weighted quasi-minimal residual approach. A numerical algorithm, referred to as shifted QMR SYM(B), is obtained by the choice of a weight which is particularly cost-effective. Numerical examples are presented to show the performance of the shifted QMR SYM(B) method.
منابع مشابه
On a weighted quasi-residual minimization strategy of the QMR method for solving complex symmetric shifted linear systems
We consider the solution of complex symmetric shifted linear systems. Such systems arise in large-scale electronic structure simulations and there is a strong need for the fast solution of the systems. With the aim of solving the systems efficiently, we consider a special case of the QMR method for non-Hermitian shifted linear systems and propose its weighted quasi-minimal residual approach. A ...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملBlock Algorithms for Quark Propagator Calculation
Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the multiple systems simultaneously. This paper compares a block generalisation of the quasi-minimal residual method (QMR), Block Conjugate Gradient on the normal eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009